An algorithm for constructing star-shaped drawings of plane graphs
نویسندگان
چکیده
منابع مشابه
Star-Shaped and L-Shaped Orthogonal Drawings
An orthogonal drawing of a plane graph G is a planar drawing of G, denoted by D(G), such that each vertex of G is drawn as a point on the plane, and each edge of G is drawn as a sequence of horizontal and vertical line segments with no crossings. An orthogonal polygon P is called orthogonally convex if the intersection of any horizontal or vertical line L and P is either a single line segment o...
متن کاملRook-drawings of Plane Graphs
We introduce a new type of graph drawing called “rook-drawing”. A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs...
متن کاملInner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. In this paper we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching. We also show that D can be found in time O(n/ logn) if G has n verti...
متن کاملMinimum-Width Grid Drawings of Plane Graphs
Given a plane graph G, we wish to draw it in the plane in such a way that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints. An additional objective is to minimize the size of the resulting grid. It is known that each plane graph can be drawn in such a way in an (n 2) x (n 2) grid (for n ~> 3), and that no grid smal...
متن کاملPlane integral drawings of planar graphs
A plane integral drawing of a planar graph G is a realization of G in the plane such that the vertices of G are mapped into distinct points and the edges of G are mapped into straight line segments of integer length which connect the corresponding vertices such that two edges have no inner point in common. We conjecture that plane integral drawings exist for all planar graphs, and we give parts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2010
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2009.06.008